搜索资源列表
ch07
- 二元搜尋樹簡單易懂，不過有一個問題：它並非平衡樹。本章將介紹平衡的 AVL 搜尋樹，討論它的資料結構、函式，並設計程式使用它。 -Simple binary search tree, but there is a problem: it is not a balanced tree. This chapter will introduce a balanced AVL search tree, to discuss its information structure, function, and
ACMsearchTREE
- ACM竞赛的一些搜索剪枝算法的应用，供大家学习-ACM search tree
suffixtree
- this is an implement of suffix tree in java which is used as search in dectionary
BinarySearchTree
- 这个文件提供的C++代码实现的二叉搜索树。这是一种高效的数据结构。非常有参考价值。-The file is about binary search tree.It is implemented with C++ language.This structur is very efficient.
binarysearchtree
- 叉查找树示例|二叉查找树,binary search tree,C语言-binary search tree
RBTreeCode
- 红黑树和二叉查找树数据结构的实现以及二者的性能比较的C语言实现代码-Red and black binary search tree and the tree data structure, as well as the achievement of the performance comparison between the C language code
search
- 以深度为k的满二叉树(n=2k-1)为例，假设表中每个记录的查找概率相等，即 pi=1/n（1≤i≤n），而树的第i层上有2i-1个结点，因此，折半查找的平均查找长度为： 所以，折半查找的平均时间复杂度为O(log2n)。 -To a depth of k over the binary tree (n = 2k-1) as an example, suppose the table to find the probability of each record the same,
csc562HW1Sol
- The search tree has a branching factor of 4. All edges have unit costs except those that go to states 5, 8 and 9 (cost 3). The node-counts given below include the start and the goal nodes (if you indicate otherwise and your answers are consistent the
btree
- 数据库的应用，基于索引，实现一个简单的B+树搜索树 -Database application, based on the index, the realization of a simple B+ tree search tree
AVLTree
- 用C实现的AVL搜索树的完整源码，包括插入操作和删除操作的具体实现，以及平衡的调整-AVL with C achieved a complete search tree source code, including the insertion operation and deletion of concrete realization, as well as the adjustment of balance
ex2list
- 二元樹搜尋 利用物件導向的技術建立二元搜尋樹 包含了所有用物件導向寫的程序-Binary tree search using object-oriented technology to build a binary search tree that contains all written using object-oriented program
BST
- This is an implementation of the Binary Search Tree algorithm.
binstree
- To learn the representation and implementation of a binary search tree.
OptimalBST
- 用C++构造的最优二分检索树,是学习算法的很好参考-This programe construct a Optical Binary Search Tree. It is the good reference to learn Anrithlog.
Bintree
- 建立二叉树，搜索二叉树等，实现了二叉树的常用功能-The establishment of tree, search tree and so on, to achieve a common feature tree
bstcnt(1)
- 二叉搜索树(Binary Search Tree)是满足如下性质的二叉树： ①若它的左子树非空，则左子树上所有结点的值均小于根结点的值； ②若它的右子树非空，则右子树上所有结点的值均大于根结点的值； ③左、右子树本身又各是一棵二叉搜索树。-Binary Search Tree (Binary Search Tree) is to meet the nature of the binary tree as follows: ① If its non-empty left subtree
BSTREE
- Binary Search Tree Implementation with extra features like Maximum Depth of a tree, Minimum element in the BST and Mirroring of BST.
BST
- 数据结构中的二叉搜索树，对于插入和遍历的功能，有动画显示-data struct ,binary search tree , can antimate the process of the insert and travel function of binary search tree
ThreeColor
- 采用回溯法，利用动态搜索树的数据结构来构造一棵解树，实现3着色问题。 本程序使用迭代回溯算法-The use of retrospective law, the use of dynamic search tree data structure to construct a solution tree, the realization of 3 coloring problem. This procedure backtracking algorithm using iterative
BSTREEE
- binary search tree is umplemented using data structures in C-binary search tree is umplemented using data structures in C++